Submodularity Helps in Nash and Nonsymmetric Bargaining
نویسندگان
چکیده
Motivated by recent insights on the two solution concepts of Nash and nonsymmetric bargaining games, obtained from an algorithmic study of these notions [Vaz09], we take a fresh look at understanding their quality and robustness by subjecting them to several “stress tests”. Our tests are quite basic, e.g., we ask whether the solutions delivered are efficient, fair, respond in a desirable manner when agents change their disagreement points or play with a subset of the agents, and whether they lend themselves to efficient computatability. Our main conclusion is that imposing submodularity, a natural economies of scale condition, on Nash and nonsymmetric bargaining games endows them with several desirable properties.
منابع مشابه
Submodularity Helps in Nash and Nonsymmetric Bargaining Games
Motivated by the recent work of [Vaz12], we take a fresh look at understanding the quality and robustness of solutions to Nash and nonsymmetric bargaining games by subjecting them to several stress tests. Our tests are quite basic, e.g., we ask whether the solutions are computable in polynomial time, and whether they have certain properties such as efficiency, fairness, desirable response when ...
متن کاملNash Bargaining Via Flexible Budget Markets
We initiate a study of Nash bargaining games [Nas50] via combinatorial, polynomial time algorithms and we carry this program over to solving nonsymmetric bargaining games of Kalai [Kal77] as well. Since the solution to a Nash bargaining game is also the optimal solution to the corresponding convex program, this involves obtaining a combinatorial algorithm for the latter. This in turn can be vie...
متن کامل2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the c...
متن کاملRational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the c...
متن کاملEmploying a Multi-Criteria Approach under Bankruptcy Conditions for Optimal Allocation of Shared Water Resources through Using Asymmetric Nash Bargaining Method
Management based on the flexibility, fairness, and sustainability characteristics of water resources may play a key role in preventing the continuation of the crisis process as well as reducing water users’ conflict. In the present research, the framework for the optimal allocation of shared water resources was presented using a combination of bankruptcy concepts and asymmetric Nash bargaining....
متن کامل